Preemptive scheduling with simple linear deterioration on a single machine
نویسندگان
چکیده
منابع مشابه
Single machine scheduling problems with delivery times under simple linear deterioration
We consider several single machine scheduling problems in which the processing time of a job is a simple linear increasing function of its starting time and each job has a delivery time. The objectives are to minimize the functions about delivery completion times. For the former three problems, we propose polynomial-time algorithms to solve them. For the last problem, we prove that it is NP-har...
متن کاملSingle Machine Scheduling with Deterioration Effect on Delivery Time ∗
A single machine scheduling problem with delivery time is considered. Job’s delivery time has deterioration effect. For the same processing time model of minimizing different objectives, it is given optimal sequences, respectively. For the same deterioration ratio model, we also give optimal sequences for different objectives. Mathematics Subject Classification: 91A35
متن کاملSingle Machine Scheduling with Job-Dependent Machine Deterioration
We consider the single machine scheduling problem with job-dependent machine deterioration. In the problem, we are given a single machine with an initial non-negative maintenance level, and a set of jobs each with a non-preemptive processing time and a machine deterioration. Such a machine deterioration quantifies the decrement in the machine maintenance level after processing the job. To avoid...
متن کاملParallel-machine scheduling with simple linear deterioration to minimize total completion time
We consider the parallel-machine scheduling problem in which the processing time of a job is a simple linear increasing function of its starting time. The objective is to minimize the total completion time. We give a fully polynomial-time approximation scheme (FPTAS) for the case with m identical machines, where m is fixed. This study solves an open problem that has been posed in the literature...
متن کاملA Possibility Linear Programming Approach to Solve a Fuzzy Single Machine Scheduling Problem
This paper employs an interactive possibility linear programming approach to solve a single machine scheduling problem with imprecise processing times, due dates, as well as earliness and tardiness penalties of jobs. The proposed approach is based on a strategy of minimizing the most possible value of the imprecise total costs, maximizing the possibility of obtaining a lower total costs, and mi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2010
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2010.05.032